Secrecy Capacity Region of Some Classes of Wiretap Broadcast Channels
نویسندگان
چکیده
منابع مشابه
Capacity results for classes of wiretap channels
We consider two communication systems which are time-discrete and memoryless, both depend on a state, in terms of information-theoretic secure data transmission. The compound channel consists of a finite or infinite set of channels which is known to both the sender and the receiver, but unfortunately it is not known which channel is in use for any codeword transmission. In contrast the state of...
متن کاملThe capacity region of classes of product broadcast channels
We establish a new outer bound for the capacity region of product broadcast channels. This outer bound matches Marton’s inner bound for a variety of classes of product broadcast channels whose capacity regions were previously unknown. These classes include product of reversely semi-deterministic and product of reversely more-capable channels. A significant consequence of this new outer bound is...
متن کاملSecrecy Capacity of Two-Hop Relay Assisted Wiretap Channels
Incorporating the physical layer characteristics to secure communications has received considerable attention in recent years. Moreover, cooperation with some nodes of network can give benefits of multiple-antenna systems, increasing the secrecy capacity of such channels. In this paper, we consider cooperative wiretap channel with the help of an Amplify and Forward (AF) relay to transmit confid...
متن کاملOn Ergodic Secrecy Capacity for Gaussian MISO Wiretap Channels
1 A Gaussian multiple-input single-output (MISO) wiretap channel model is considered, where there exists a transmitter equipped with multiple antennas, a legitimate receiver and an eavesdropper each equipped with a single antenna. We study the problem of finding the optimal input covariance that achieves ergodic secrecy capacity subject to a power constraint where only statistical information a...
متن کاملSecrecy Capacity-Memory Tradeoff of Erasure Broadcast Channels
This paper derives upper and lower bounds on the secrecy capacity-memory tradeoff of a wiretap erasure broadcast channel (BC) with Kw weak receivers and Ks strong receivers, where weak receivers, respectively strong receivers, have same erasure probabilities and cache sizes. The lower bounds are achieved by schemes that meticulously combine joint cache-channel coding with wiretap coding and key...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2015
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2015.2463279